A Simulated Annealing Enhancement of the Best-Fit Heuristic for the Orthogonal Stock-Cutting Problem
نویسندگان
چکیده
منابع مشابه
A Simulated Annealing Enhancement of the Best-Fit Heuristic for the Orthogonal Stock-Cutting Problem
The best-fit heuristic is a simple yet powerful one-pass approach for the two-dimensional rectangular stock cutting problem. It had achieved the best published results on a wide range of benchmark problems until the development of the approaches described in this paper. Here, we illustrate how improvements in solution quality can be achieved by the hybridisation of the bestfit heuristic togethe...
متن کاملA New Placement Heuristic for the Orthogonal Stock-Cutting Problem
This paper presents a new best-fit heuristic for the two-dimensional rectangular stock-cutting problem and demonstrates its effectiveness by comparing it against other published approaches. A placement algorithm usually takes a list of shapes, sorted by some property such as increasing height or decreasing area, and then applies a placement rule to each of these shapes in turn. The proposed met...
متن کاملA new Simulated Annealing algorithm for the robust coloring problem
The Robust Coloring Problem (RCP) is a generalization of the well-known Graph Coloring Problem where we seek for a solution that remains valid when extra edges are added. The RCP is used in scheduling of events with possible last-minute changes and study frequency assignments of the electromagnetic spectrum. This problem has been proved as NP-hard and in instances larger than 30 vertices, meta-...
متن کاملComposite Stock Cutting through Simulated Annealing†
This paper explores the use of Simulated Annealing as an optimization technique for the problem Composite Material Stock Cutting. The shapes are not constrained to be convex polygons or even regular shapes. However, due to the composite nature of the material, the orientation of the shapes on the stock is restricted. For placements of various shapes, we show how to determine a cost function, an...
متن کاملSolving an one-dimensional cutting stock problem by simulated annealing and tabu search
A cutting stock problem is one of the main and classical problems in operations research that is modeled as Lp < /div> problem. Because of its NP-hard nature, finding an optimal solution in reasonable time is extremely difficult and at least non-economical. In this paper, two meta-heuristic algorithms, namely simulated annealing (SA) and tabu search (TS), are proposed and deve...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: INFORMS Journal on Computing
سال: 2009
ISSN: 1091-9856,1526-5528
DOI: 10.1287/ijoc.1080.0306